package com.code.algorithm;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

/**
 * 二叉树层序遍历
 */
public class LevelOrder {
     public class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;
    }

    public ArrayList<ArrayList<Integer>> levelOrder (TreeNode root) {
        // write code here

        Queue<Integer> q = new LinkedList<>();

        return null;
    }
}
